Hierarchical Data Representations Based on Planar Voronoi Diagrams
نویسندگان
چکیده
Multiresolution representation of high-dimensional scattered data is a fundamental problem in scientific visualization. This paper introduces a data hierarchy of Voronoi diagrams as a versatile solution. Given an arbitrary set of points in the plane, our goal is the construction of an approximation hierarchy using the Voronoi diagram as the essential building block. We have implemented two Voronoi diagram-based algorithms to demonstrate their usefulness for hierarchical scattered data approximation. The first algorithm uses a constant function to approximate the data within each Voronoi cell, and the second algorithm uses the Sibson interpolant [14].
منابع مشابه
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time
We present an explicit and efficient construction of additively weighted Voronoi diagrams on planar graphs. Let G be a planar graph with n vertices and b sites that lie on a constant number of faces. We show how to preprocess G in Õ(nb) time so that one can compute any additively weighted Voronoi diagram for these sites in Õ(b) time. We use this construction to compute the diameter of a directe...
متن کاملVoronoi diagram and medial axis algorithm for planar domains with curved boundaries — II: Detailed algorithm description
Details of algorithms to construct the Voronoi diagrams and medial axes of planars domain bounded by free-form (polynomial or rational) curve segments are presented, based on theoretical foundations given in the rst installment Ramamurthy and Farouki, J. Comput. Appl. Math. (1999) 102 119–141 of this two-part paper. In particular, we focus on key topological and computational issues that arise ...
متن کاملNew Results on Abstract Voronoi Diagrams
Voronoi diagrams are a fundamental structure used in many areas of science. For a given set of objects, called sites, the Voronoi diagram separates the plane into regions, such that points belonging to the same region have got the same nearest site. This definition clearly depends on the type of given objects, they may be points, line segments, polygons, etc. and the distance measure used. To f...
متن کاملVoronoi diagrams on planar graphs, and computing the diameter in deterministic $\tilde{O}(n^{5/3})$ time
We present an explicit and efficient construction of additively weighted Voronoi diagrams on planar graphs. Let G be a planar graph with n vertices and b sites that lie on a constant number of faces. We show how to preprocess G in Õ(nb) time so that one can compute any additively weighted Voronoi diagram for these sites in Õ(b) time. We use this construction to compute the diameter of a directe...
متن کاملVoronoi diagrams on the spher
Given a set of compact sites on a sphere, we show that their spherical Voronoi diagram can be computed by computing two planar Voronoi diagrams of suitably transformed sites in the plane. We also show that a planar furthest-site Voronoi diagram can always be obtained as a portion of a nearest-site Voronoi diagram of a set of transformed sites. Two immediate applications are an O(n logn) algorit...
متن کامل